Algoritmo de Karmarkar y matrices ralas
نویسندگان
چکیده
منابع مشابه
Un algoritmo para detectar la polaridad de opiniones en los dominios de laptops y restaurantes
In this article, we present a study for the detection of polarity over a dataset of opinions of users over Restaurants in the Spanish and English language, as well as, opinions about Laptops in the English language. As a proposed solution, we use Vector Support Machine with cross validation. The best results were presented for the Spanish Restaurant Domain with 74% accuracy.
متن کاملParsing bidimensional de estructuras DAG mediante el algoritmo SCP y su aplicación al reconocimiento de habla
This work describes an strategy for the integration of speech recognition, unificationbased parsing and dialogue managent and its application to spoken dialogue systems. The strategy is based on the use of the notion of breaking points implemented by the SCP (Syntactic Constraints Propagation) parsing algorithm. This format allows the representation of word lattices and their direct manipulatio...
متن کاملAlgoritmo de Clustering On-Line utilizando metaheurísticas y técnicas de muestreo
Document clustering involves dividing a set of documents into separate clusters (subsets), so that the documents are similar to other documents in the same cluster, and less similars or different from documents in other clusters. In certain conditions the clustering is a computational expensive task, for example: working with a huge collection of documents without prior knowlegdge of the approp...
متن کاملAcerca del Algoritmo de Dijkstra
Dado un grafo con etiquetas no negativas, se trata de calcular el coste del camino mı́nimo desde un vértice dado al resto (ing., single-source shortest paths). La utilidad de un procedimiento que solucione esta cuestión es clara: el caso más habitual es disponer de un grafo que represente una distribución geográfica, donde las aristas den el coste (en precio, en distancia o similares) de la cone...
متن کاملAlgoritmo de reducción de grafos sin pérdida de información
Algorithms related to graph theory have been studied widely. Several studies deal with the reduction of temporal complexity of these algorithms. The techniques used in this sense are generally based on reducing the graph or the search space of solution. These approaches remove redundant information for a specific kind of problem. The process of reducing a graph is based on obtaining smaller gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Matemática: Teoría y Aplicaciones
سال: 2009
ISSN: 1409-2433
DOI: 10.15517/rmta.v2i2.117